Erratum to "On discrete Gauss-Hermite functions and eigenvectors of the discrete Fourier transform" [Signal Processing 88 (11) (2008) 2738-2746]
نویسندگان
چکیده
1. Page 2741, caption of Fig. 2: three occurrences of ‘‘commutator’’ instead of ‘‘commutor’’, i.e. the caption should read Fig. 2. Eigenvalue decomposition of the commutor for the CDFT: (a) sorted eigenvalues of the commutor T1 for N 1⁄4 128. (b) Selected symmetric and skew-symmetric eigenvectors of the commutor for k 1⁄4 0,1, 2, 3. 2. Page 2743, fourth sentence after Eq. (14): ‘‘commutator’’ instead of ‘‘commutor’’, i.e. the sentence should read In addition the eigenvalue spectrum on the commutor exhibits deviations from the eigenvalue spectrum seen in the case of the CDFT at two regions as seen in Fig. 4(a) for the choice of a 1⁄4 a1 1⁄4 0, due to the eigenvalue degeneracy. 3. Page 2743, paragraph following Eq. (19): three occurrences of ‘‘commutator’’ instead of ‘‘commutor’’, i.e. the paragraph should read commutes with the DFT matrix. The eigenvalues of the commutor are exactly the same as those seen for the CDFT as seen in Fig. 4(c). The eigenvectors of this commutor are K-symmetric or K-anti-symmetric with K 1⁄4 W as described in the Appendix, where we outline an algorithm to construct K-symmetric and K-anti-symmetric eigenvectors from the even and odd eigen-subspaces of a generalized K-symmetric matrix. The symmetric involution matrix K used in the formulation of the K-symmetric matrix framework for computing the eigenvectors of the commutor can be any cyclic permutation matrix that commutes with the DFT and does not need to be W [17]. 4. Page 2744, caption of Fig. 4: two occurrences of ‘‘commutator’’ instead of ‘‘commutor’’, i.e. the caption should read Fig. 4. Eigenvalue spectrum of the commutor T̃1 for the DFT: (a) symmetric difference of the eigenvalue spectrum of the commutor depicting eigenvalue degeneracy, (b) symmetric difference of the eigenvalue spectrum for N 1⁄4 128 using a2 for the asymmetric vector, (c) the corresponding, symmetric difference spectrum when just Eq. (6) is satisfied. 5. Page 2745, caption of Fig. 5: ‘‘commutator’’ instead of ‘‘commutor’’, i.e. the caption should read Fig. 5. Eigenvalue decomposition of T̃2: symmetric difference of the eigenvalue spectrum of the generalized commutor for N 1⁄4 128. The observed symmetric difference of two for a significant portion of the spectrum is indicative of the uniform integer spacing between eigenvalues—a unique feature of the proposed approach.
منابع مشابه
On the Grunbaum Commutor Based Discrete Fractional Fourier Transform
The basis functions of the continuous fractional Fourier transform (FRFT) are linear chirp signals that are suitable for time-frequency analysis of signals with chirping timefrequency content. Efforts to develop a discrete computable version of the fractional Fourier transform (DFRFT) have focussed on furnishing a orthogonal set of eigenvectors for the DFT that serve as discrete versions of the...
متن کاملDiscrete fractional Fourier transform based on the eigenvectors of tridiagonal and nearly tridiagonal matrices
The recent emergence of the discrete fractional Fourier transform (DFRFT) has caused a revived interest in the eigenanalysis of the discrete Fourier transform (DFT) matrix F with the objective of generating orthonormal Hermite-Gaussian-like eigenvectors. The Grünbaum tridiagonal matrix T – which commutes with matrix F – has only one repeated eigenvalue with multiplicity two and simple remaining...
متن کاملAn Efficient Hamiltonian for Discrete Fractional Fourier Transform
Fractional Fourier Transform, which is a generalization of the classical Fourier Transform, is a powerful tool for the analysis of transient signals. The discrete Fractional Fourier Transform Hamiltonians have been proposed in the past with varying degrees of correlation between their eigenvectors and Hermite Gaussian functions. In this paper, we propose a new Hamiltonian for the discrete Fract...
متن کاملExplicit Hermite-type Eigenvectors of the Discrete Fourier Transform
The search for a canonical set of eigenvectors of the discrete Fourier transform has been ongoing for more than three decades. The goal is to find an orthogonal basis of eigenvectors which would approximate Hermite functions – the eigenfunctions of the continuous Fourier transform. This eigenbasis should also have some degree of analytical tractability and should allow for efficient numerical c...
متن کاملTwo dimensional discrete fractional Fourier transform
Fractional Fourier transform (FRFT) performs a rotation of signals in the time—frequency plane, and it has many theories and applications in time-varying signal analysis. Because of the importance of fractional Fourier transform, the implementation of discrete fractional Fourier transform will be an important issue. Recently, a discrete fractional Fourier transform (DFRFT) with discrete Hermite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal Processing
دوره 89 شماره
صفحات -
تاریخ انتشار 2009